Monotonically labelled Motzkin trees
نویسندگان
چکیده
منابع مشابه
Monotonically labelled Motzkin trees
Consider a rooted tree structure the nodes of which have been labelled monotonically by elements of { 1, 2, . . .,k}, which means that any sequence connecting the root of the tree with a leaf is weakly monotone . For fixed k asymptotic equivalents of the form CA gA °n; 2 (n --oo) to the numbers of such tree structures with n nodes are obtained for the family of extended unary-binary trees (i .e...
متن کاملOn Heights of Monotonically Labelled Binary Trees
A monotonically labelled binary tree is a binary tree with integer labels attached to the internal nodes in such a way that the labels along any path from the root are nondecreasing. If there is only one label, we are dealing with ordinary binary trees. Prodinger and Urbanek [6] introduced a variety of families of monotonically labelled trees and obtained enumerative results about many of them....
متن کاملSome results for monotonically labelled simply generated trees
We consider simply generated trees, where the nodes are equipped with weakly monotone labellings with elements of {1,2, . . . ,r}, for r fixed. These tree families were introduced in Prodinger and Urbanek (1983) and studied further in Kirschenhofer (1984), Blieberger (1987), and Morris and Prodinger (2005). Here we give distributional results for several tree statistics (the depth of a random n...
متن کاملSecondary structures, plane trees and Motzkin numbers
A bijective correspondence is established between secondary structures of a given rank and size and plane trees satisfying certain additional conditions. The correspondence is then used to obtain new combinatorial interpretations of Motzkin numbers in terms of plane trees and Dyck paths.
متن کاملOperated semigroups, Motzkin paths and rooted trees
Combinatorial objects such as rooted trees that carry a recursive structure have found important applications recently in both mathematics and physics. We put such structures in an algebraic framework of operated semigroups. This framework provides the concept of operated semigroups with intuitive and convenient combinatorial descriptions, and at the same time endows the familiar combinatorial ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1987
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90038-2